Off-line temporary tasks assignment

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Off-Line Temporary Tasks Assignment

In this paper we consider the temporary tasks assignment problem. In this problem, there are m parallel machines and n independent jobs. Each job has an arrival time, a departure time and some weight. Each job should be assigned to one machine. The load on a machine at a certain time is the sum of the weights of jobs assigned to it at that time. The objective is to nd an assignment that minimiz...

متن کامل

On-line restricted assignment of temporary tasks with unknown durations

We consider load balancing of temporary tasks on m machines in the restricted assignment model. It is known that the best competitive ratio for this problem is Θ( √ m). This bound is not achieved by the greedy algorithm whose competitive ratio is known to be Ω(m 2 3 ). We give an alternative analysis to the greedy algorithm which is better than the known analysis for relatively small values of ...

متن کامل

Task attribute assignment of fixed priority scheduled tasks to reenact off-line schedules

A number of industrial applications advocate the use of time triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-end deadlines. The rigid offline scheduling schemes used for time triggered systems, however, do not provide for flexibility. Fixed priority scheduling can provide more flexibility, but is limited with respect to predi...

متن کامل

On-Line Load Balancing of Temporary Tasks on Identical Machines

We prove an exact lower bound of 2 1 m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 1 m for randomized algorithms for small m and 2 2 m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2 O( log logm logm )...

متن کامل

Off-line Survivable Impairment-aware Routing and Wavelength Assignment

Physical impairments caused by noise and signal distortions affect the quality of an optical signal. The effect of physical impairments becomes more significant with an increase in distance and bit rates. In order to minimize the bit error rate (BER), an optical signal may need to be regenerated after a certain distance. This is mainly achieved through re-amplification, re-shaping, and retiming...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2002

ISSN: 0304-3975

DOI: 10.1016/s0304-3975(01)00254-7